#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
LL ksm(LL a,LL k){
   LL res=1;
   while(k>0){
      if(k&1) res=res*a;
      k>>=1;
      a=a*a;
   }return res;
}
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n;cin>>n;
   for(LL i=1;i<=n;i++) cin>>a[i];
   sort(a+1,a+1+n);
   LL sum=1e18;
   for(LL i=1;i<=1e5+100;i++){
       if(ksm(i,min((LL)50,n-1))>1e10){break;}
       LL temp=0;
       for(LL j=1;j<=n;j++){
           temp+=abs(ksm(i,j-1)-a[j]);
       }
       sum=min(sum,temp);
    ///   debug(temp);
   }
   cout<<sum<<"\n";
   return 0;
}
